Iterated logarithm approximations to the distribution of the largest prime divisor

The paper is concerned with estimating the number of integers smaller than x whose largest prime divisor is smaller than y, denoted ψ(x, y). Much of the related literature is concerned with approximating ψ(x, y) by Dickman’s function ρ(u), where u = lnx/ ln y. A typical such result is that ψ(x, y) = xρ(u)(1 + o(1)) (1) in a certain domain of the parameters x and y. In this paper a different type of approximation of ψ(x, y), using iterated logarithms of x and y, is presented. We establish that ln ( ψ x ) = −u[ln x− ln y + ln x− ln y + ln x− a] (2) where a < a < ā for some constants a and ā (denoting by ln x = ln ... lnx the k-fold iterated logarithm). The approximation (2) holds in a domain which is complementary to the one on which the approximation (1) is known to be valid. One consequence of (2) is an asymptotic expression for Dickman’s function, which is of the form ln ρ(u) = −u[lnu + ln u](1 + o(1)), improving known asymptotic approximations of this type. We employ (2) to establish a version of Bertrand’s Conjecture, indicating how this method may be used to sharpen the result.